Infinitary $\lambda$-Calculi from a Linear Perspective (Long Version)

نویسنده

  • Ugo Dal Lago
چکیده

We introduce a linear infinitary λ-calculus, called `Λ∞, in which two exponential modalities are available, the first one being the usual, finitary one, the other being the only construct interpreted coinductively. The obtained calculus embeds the infinitary applicative λ-calculus and is universal for computations over infinite strings. What is particularly interesting about `Λ∞, is that the refinement induced by linear logic allows to restrict both modalities so as to get calculi which are terminating inductively and productive coinductively. We exemplify this idea by analysing a fragment of `Λ built around the principles of SLL and 4LL. Interestingly, it enjoys confluence, contrarily to what happens in ordinary infinitary λ-calculi.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Linear realizability and full completeness for typed lambda-calculi

We present the model construction technique called Linear Realizability. It consists in building a category of Partial Equivalence Relations over a Linear Combinatory Algebra. We illustrate how it can be used to provide models, which are fully complete for various typed λ-calculi. In particular, we focus on special Linear Combinatory Algebras of partial involutions, and we present PER models ov...

متن کامل

Strict Ideal Completions of the Lambda Calculus

We present a family of infinitary lambda calculi with varying strictness. This family of calculi corresponds to the infinitary lambda calculi of Kennaway et al. but instead of metric completion our calculi are based on ideal completion. We show that each of our calculi conservatively extends the corresponding metric-based calculus. The extension that our calculi provide is characterised in the ...

متن کامل

Separability of Infinite Lambda Terms

Infinite lambda calculi extend finite lambda calculus with infinite terms and transfinite reduction. In this paper we extend some classical results of finite lambda calculus to infinite terms. The first result we extend to infinite terms is Böhm Theorem which states the separability of two finite βη-normal forms. The second result we extend to infinite terms is the equivalence of the prefix rel...

متن کامل

Infinitary Lambda Calculi and Böhm Models

Infinitely long rewrite sequences of possibly infinite terms are of interest for several reasons. Firstly, infinitary rewriting is a natural generalisation of finitary rewriting which extends it with the notion of computing towards a possibily infinite limit. Such limits naturally arise in the semantics of lazy functional languages, in which it is possible to write and compute with expressions ...

متن کامل

The infinitary lambda calculus of the infinite eta Böhm trees

In this paper, we introduce a strong form of eta reduction called etabang that we use to construct a confluent and normalising infinitary lambda calculus, of which the normal forms correspond to Barendregt’s infinite eta Böhm trees. This new infinitary perspective on the set of infinite eta Böhm trees allows us to prove that the set of infinite eta Böhm trees is a model of the lambda calculus. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016